We present general conditions for quantum error suppression forHamiltonian-based quantum computation using subsystem codes. This involvesencoding the Hamiltonian performing the computation using an error detectingsubsystem code and the addition of a penalty term that commutes with theencoded Hamiltonian. The scheme is general and includes the stabilizerformalism of both subspace and subsystem codes as special cases. We deriveperformance bounds and show that complete error suppression results in thelarge penalty limit. To illustrate the power of subsystem-based errorsuppression, we introduce fully 2-local constructions for protection of theswap gate of adiabatic gate teleportation and the Ising chain in a transversefield.
展开▼